Separating Significant Matches from Spurious Matches in DNA Sequences
نویسندگان
چکیده
منابع مشابه
Approximate Word Matches between Two Random Sequences
Given two sequences over a finite alphabet L, the D2 statistic is the number of m-letter word matches between the two sequences. This statistic is used in bioinformatics for expressed sequence tag database searches. Here we study a generalization of the D2 statistic in the context of DNA sequences, under the assumption of strand symmetric Bernoulli text. For k <m, we look at the count of m-lett...
متن کاملRepeated-sprint sequences during youth soccer matches.
This study examined the occurrence and nature of repeated-sprint sequences (RSS) in highly-trained young soccer players, as a function of age, playing position and playing time. Time-motion analyses using a global positioning system (GPS) were performed on 99 highly-trained young soccer (U13, U14, U15, U16, U17 and U18) players during 42 international games. Sprint activities were defined as at...
متن کاملDo Weave Matches Imply Canvas Roll Matches?
Computational algorithms for measuring thread counts from scanned x-rays produce warp and weft thread count “maps” across entire paintings. Within the database of over 300 van Gogh paintings, we found a clique of 44 warp-weave-matched paintings. By reconstructing the smallest canvas section that could have produced this match, they must span the entire width of a commercial canvas roll (2+ mete...
متن کاملEuclidean reconstruction from contour matches
This paper presents a method that recovers a Euclidean structure from contour matching results. If three or more views are available, structure reconstruction without camera calibration is possible. This is the rst attempt at structure reconstruction from contour matches, though there are works on structure reconstruction from point matches. We also propose a new method that integrates more tha...
متن کاملCharacterizing the D2 statistic: word matches in biological sequences.
Word matches are often used in sequence comparison methods, either as a measure of sequence similarity or in the first search steps of algorithms such as BLAST or BLAT. The D2 statistic is the number of matches of words of k letters between two sequences. Recent advances have been made in the characterization of this statistic and in the approximation of its distribution. Here, these results ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Biology
سال: 2012
ISSN: 1066-5277,1557-8666
DOI: 10.1089/cmb.2011.0070